Static and dynamic low-congested interval routing schemes

Static and Dynamic Low-Congested Interval Routing Schemes

Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS Transputer Router Chips. In this paper we consider IRS that are optimal with respect to the congestion of the...

Static and Dynamic Low-Congested Interval Routing Schemes

Low Congested Interval Routing Schemes

In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterries, wrapped butterries and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already suucient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. More...

Static and Dynamic Low - Congested Interval

Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special regard to shortest paths. Besides their theoretical interest , IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS Transputer Router Chips. In this paper we consider IRS that are optimal with respect to the congestion of the ...

Low-congested interval routing schemes for hypercubelike networks

In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterflies, wrapped butterflies and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already sufficient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. ...